Dynamic programming and principles of optimality
نویسندگان
چکیده
منابع مشابه
Pansystems optimization, generalized principles of optimality, and fundamental equations of dynamic programming
Introduction In the theory of dynamic programming (Bellman, 1957; Bellman and Dreyfus, 1962), the Bellman principle of optimality was not called into question until Rudd and Blum found a wrong solution for a chemical reaction system (Jackson, 1963; Rudd and Blum, 1962). Although the Bellman principle of optimality is true for almost all practical problems, there are still some problems, both th...
متن کاملTwo Characterizations of Optimality in Dynamic Programming
It holds in great generality that a plan is optimal for a dynamic programming problem, if and only if it is “thrifty” and “equalizing.” An alternative characterization of an optimal plan, that applies in many economic models, is that the plan must satisfy an appropriate Euler equation and a transversality condition. Here we explore the connections between these two characterizations.
متن کاملOn the Principle of Optimality for Nonstationary Deterministic Dynamic Programming∗
This note studies a general nonstationary infinite-horizon optimization problem in discrete time. We allow the state space in each period to be an arbitrary set, and the return function in each period to be unbounded. We do not require discounting, and do not require the constraint correspondence in each period to be nonempty-valued. The objective function is defined as the limit superior or in...
متن کاملdiagnostic and developmental potentials of dynamic assessment for writing skill
این پایان نامه بدنبال بررسی کاربرد ارزیابی مستمر در یک محیط یادگیری زبان دوم از طریق طرح چهار سوال تحقیق زیر بود: (1) درک توانایی های فراگیران زمانیکه که از طریق برآورد عملکرد مستقل آنها امکان پذیر نباشد اما در طول جلسات ارزیابی مستمر مشخص شوند; (2) امکان تقویت توانایی های فراگیران از طریق ارزیابی مستمر; (3) سودمندی ارزیابی مستمر در هدایت آموزش فردی به سمتی که به منطقه ی تقریبی رشد افراد حساس ا...
15 صفحه اولDynamic programming using local optimality conditions for action elimination
In the theory of dynamic programming (DP) the elimination of non-optimal actions is an important topic. For many DP problems the calculation is slow and action elimination helps to speed up the calculation. A great part of this thesis is dedicated to the development of action elimination procedures for various classes of DP problems. Common to all these action elimination procedures is that the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1978
ISSN: 0022-247X
DOI: 10.1016/0022-247x(78)90166-x